Constructing Conjunctions using Systematic Search onDecision
نویسنده
چکیده
This paper investigates a dynamic path-based method for constructing conjunctions as new attributes for decision tree learning. It searches for conditions (attribute-value pairs) from paths to form new attributes. Compared with other hypothesis-driven new attribute construction methods, the new idea of this method is that it carries out systematic search with pruning over each path of a tree to select conditions for generating a conjunction. Therefore, conditions for constructing new attributes are dynamically decided during search. Empirically evaluation in a set of artiicial and real-world domains shows that the dynamic path-based method can improve the performance of selective decision tree learning in terms of both higher prediction accuracy and lower theory complexity. In addition, it shows some performance advantages over a xed path-based method and a xed rule-based method for learning decision trees.
منابع مشابه
Constructing Conjunctive Attributes using Production Rules
Many existing constructive decision tree learning algorithms such as Fringe and Citre construct conjunctions or disjunctions directly from paths of decision trees. This paper investigates a novel attribute construction method for decision tree learning. It creates conjunctions from production rules that are transformed from decision trees. Irrelevant or unimportant conditions are eliminated whe...
متن کاملConstructing Conjunctive Attributes Using Production Rules
Many existing constructive decision tree learning algorithms such as Fringe and Citre construct conjunctions or disjunctions directly from paths of decision trees. This paper investigates a novel attribute construction method for decision tree learning. It creates conjunctions from production rules that are transformed from decision trees. Irrelevant or unimportant conditions are eliminated whe...
متن کاملGuided search: an alternative to the feature integration model for visual search.
Subjects searched sets of items for targets defined by conjunctions of color and form, color and orientation, or color and size. Set size was varied and reaction times (RT) were measured. For many unpracticed subjects, the slopes of the resulting RT X Set Size functions are too shallow to be consistent with Treisman's feature integration model, which proposes serial, self-terminating search for...
متن کاملBoolean versus ranked querying for biomedical systematic reviews
BACKGROUND The process of constructing a systematic review, a document that compiles the published evidence pertaining to a specified medical topic, is intensely time-consuming, often taking a team of researchers over a year, with the identification of relevant published research comprising a substantial portion of the effort. The standard paradigm for this information-seeking task is to use Bo...
متن کاملA Binary Schema and Computational Algorithms to Process Vowel-based Euphonic Conjunctions for Word Searches
Comprehensively searching for words in Sanskrit E-text is a non-trivial problem because words could change their forms in different contexts. One such context is sandhi or euphonic conjunctions, which cause a word to change owing to the presence of adjacent letters or words. The change wrought by these possible conjunctions can be so significant in Sanskrit that a simple search for the word in ...
متن کامل